Smooth Orthogonal Layouts
نویسندگان
چکیده
منابع مشابه
Smooth Orthogonal Layouts
We study the problem of creating smooth orthogonal layouts for planar graphs. While in traditional orthogonal layouts every edge is made of a sequence of axis-aligned line segments, in smooth orthogonal layouts every edge is made of axis-aligned segments and circular arcs with common tangents. Our goal is to create such layouts with low edge complexity, measured by the number of line and circul...
متن کاملOrthogonal layouts using the deltahedron heuristic
,u.)-eUl''''''' and may be based on consideration of maximization of Lv~"HLVU'H"fJ chart scores or on the minimization of overall cost. We assume that all are pre;ter'able. Geometric duality that the adjacency graph be planar. context, this translates to maximal planarity, since adding further to
متن کاملSmooth Orthogonal Projections on Sphere
We construct a decomposition of the identity operator on the sphere S as a sum of smooth orthogonal projections subordinate to an open cover of S. We give applications of our main result in the study of function spaces and Parseval frames on the sphere.
متن کاملArbitrarily Smooth Orthogonal Nonseparable Wavelets in R
For each r ∈ N, we construct a family of bivariate orthogonal wavelets with compact support that are nonseparable and have vanishing moments of order r or less. The starting point of the construction is a scaling function that satisfies a dilation equation with special coefficients and a special dilation matrix M : the coefficients are aligned along two adjacent rows, and |det(M)| = 2. We prove...
متن کاملSmooth Orthogonal Drawings of Planar Graphs
In smooth orthogonal layouts of planar graphs, every edge is an alternating sequence of axis-aligned segments and circular arcs with common axisaligned tangents. In this paper, we study the problem of finding smooth orthogonal layouts of low edge complexity, that is, with few segments per edge. We say that a graph has smooth complexity k—for short, an SCk-layout—if it admits a smooth orthogonal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2013
ISSN: 1526-1719
DOI: 10.7155/jgaa.00305